By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 32, Issue 3, pp. 557-832

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks

Hasan Çam

pp. 557-585

Identity-Based Encryption from the Weil Pairing

Dan Boneh and Matthew Franklin

pp. 586-615

3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations

Vladlen Koltun and Micha Sharir

pp. 616-642

Setting Parameters by Example

David Eppstein

pp. 643-653

An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee

Stephan J. Eidenbenz and Peter Widmayer

pp. 654-670

Parallel Processor Scheduling with Limited Number of Preemptions

Oliver Braun and Günter Schmidt

pp. 671-680

Nondeterministic Quantum Query and Communication Complexities

Ronald de Wolf

pp. 681-699

Semi-Online Maintenance of Geometric Optima and Measures

Timothy M. Chan

pp. 700-716

Improved Bounds for the Online Scheduling Problem

John F. Rudin, III and R. Chandrasekaran

pp. 717-735

New Lower Bound Techniques for Dynamic Partial Sums and Related Problems

Thore Husfeldt and Theis Rauhe

pp. 736-753

The Reconstruction of Doubled Genomes

Nadia El-Mabrouk and David Sankoff

pp. 754-792

Expected-Case Complexity of Approximate Nearest Neighbor Searching

Sunil Arya and Ho-Yam Addy Fu

pp. 793-815

The Online Median Problem

Ramgopal R. Mettu and C. Greg Plaxton

pp. 816-832